package LC;

import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;

/**
 * https://leetcode.com/problems/insert-interval/description/
 * Given a set of non-overlapping intervals,
 * insert a new interval into the intervals (merge if necessary).
 * You may assume that the intervals were initially sorted according to their start times.
 * Example 1:
 * Given intervals [1,3],[6,9], insert and merge [2,5] in as [1,5],[6,9].
 * Example 2:
 * Given [1,2],[3,5],[6,7],[8,10],[12,16], insert and merge [4,9] in as [1,2],[3,10],[12,16].
 * This is because the new interval [4,9] overlaps with [3,5],[6,7],[8,10].
 */
public class LC_057_InsertInterval_IfElse {
    public static void main(String[] args) {
        List<Interval> intervals = Arrays.asList(
                new Interval(1, 2),
                new Interval(3, 5),
                new Interval(6, 7),
                new Interval(8, 10),
                new Interval(12, 16)
        );
        Interval newInterval = new Interval(4, 9);
        List<Interval> res = Solution.insert(intervals, newInterval);
        System.out.println(intervals);
        System.out.println(newInterval);
        System.out.println(res.toString());
    }

    static class Interval {
        int start;
        int end;

        Interval() {
            start = 0;
            end = 0;
        }

        Interval(int s, int e) {
            start = s;
            end = e;
        }

        @Override
        public String toString() {
            return "[" + start + " " + end + "]";
        }
    }

    static class Solution {
        public static List<Interval> insert(List<Interval> intervals, Interval newInterval) {
            if (newInterval == null)
                return intervals;
            int len = intervals.size();
            if (len == 0) {
                intervals.add(newInterval);
                return intervals;
            }
            List<Interval> res = new ArrayList<>();
            for (Interval interval : intervals) {
                if (interval.end < newInterval.start)
                    res.add(interval);
                else if (interval.start > newInterval.end) {
                    res.add(newInterval);
                    newInterval = interval;
                } else if (interval.start <= newInterval.end || interval.end >= newInterval.start)
                    newInterval = new Interval(Math.min(interval.start, newInterval.start), Math.max(interval.end, newInterval.end));
            }
            res.add(newInterval);
            return res;
        }
    }
}
